A quantum version of Schoning's algorithm applied to quantum 2-SAT
نویسندگان
چکیده
منابع مشابه
A quantum version of Schoning's algorithm applied to quantum 2-SAT
Edward Farhi,1 Shelby Kimmel,1, 2 and Kristan Temme1, 3, 4 1Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA 2Joint Center for Quantum Information and Computer Science (QuICS), University of Maryland, College Park, MD 20742, USA 3Institute for Quantum Information and Matter, California Institute of Technology, Pasadena CA 91125, USA 4IBM TJ Watson ...
متن کاملEfficient algorithm for a quantum analogue of 2-SAT
Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists a state |Ψ〉 of n qubits such that its k-qubit reduced density matrices have support on prescribed subspaces. We present a classical algorithm solving quantum 2-SAT in a polynomial time. It generalizes the well-known algorithm for the classical 2-SAT. Besides, w...
متن کاملA Linear Time Algorithm for Quantum 2-SAT
The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically motivated generalization of k-SAT to the quantum setting, defining the problem “quantum k-SAT”. He showed that quantum 2-SAT is also solvable in polynomial t...
متن کاملQUANTUM VERSION OF TEACHING-LEARNING-BASED OPTIMIZATION ALGORITHM FOR OPTIMAL DESIGN OF CYCLIC SYMMETRIC STRUCTURES SUBJECT TO FREQUENCY CONSTRAINTS
As a novel strategy, Quantum-behaved particles use uncertainty law and a distinct formulation obtained from solving the time-independent Schrodinger differential equation in the delta-potential-well function to update the solution candidates’ positions. In this case, the local attractors as potential solutions between the best solution and the others are introduced to explore the solution space...
متن کاملQuantum Algorithm for SAT Problem and Quantum Mutual Entropy
It is von Neumann who opened the window for today’s Information epoch. He defined quantum entropy including Shannon’s information more than 20 years ahead of Shannon, and he introduced a concept what computation means mathematically. In this paper I will report two works that we have recently done, one of which is on quantum algorithum in generalized sense solvimg the SAT problem (one of NP com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2016
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic16.13-14-7